An optimistic ternary simulation of gate races
نویسندگان
چکیده
منابع مشابه
Optimistic Trace-driven Simulation
Parallel simulation of multiprocessor architectures is a promising direction because a parallel system provides the high computation and storage capabilities that are required by detailed architectural simulation. Additionally, the behavior of the target system exhibits natural parallelism. In this paper, we consider the evaluation of the memory hierarchy of multiprocessor systems via parallel ...
متن کاملScalable Optimistic Parallel Simulation
Computer simulation of large and complex systems in various elds of science and engineering requires tremendous computational resources, and is limited by sequential simulation algorithms in most practical cases. Parallel simulation ooers the potential to accelerate simulations so as to facilitate the study of complex dynamic systems with large problem sizes, to explore large parameter spaces, ...
متن کاملOptimistic Real-Time Simulation
On-line simulations play a critical role in understanding, supervising, and controlling large-scale systems. For instance, in military training applications, users are presented with complex scenarios that consist of both actual and simulated devices interacting in real-time. Troubleshooting of complex telephone networks may utilize on-line simulations to play`what if' games when evaluating alt...
متن کاملAn Algorithm for Fully-reversible Optimistic Parallel Simulation
Typically, large-scale optimistic parallel simulations will spend 90% or more of the total execution time forward processing events and very little time executing rollbacks. In fact, it was recently shown that a large-scale TCP model consisting of over 1 million nodes will execute without generating any rollbacks (i.e., perfect optimistic execution is achieved). The major cost involved in forwa...
متن کاملAn Eecient Conditional-knowledge Based Optimistic Simulation Scheme
We present in this paper a single-hop version of the conditional-knowledge approach to optimistic simulations 10]. The algorithm has potentially lower memory requirements than the conventional time-warp algorithm and uses a single negative message between processes for cancellation of multiple erroneously sent messages. In time-warp, each processed message is stored both on the output queue of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90107-7